Unique prime factorization in a partial semigroup of matrix-polynomials
نویسندگان
چکیده
منابع مشابه
Unique Prime Cartesian Factorization of Graphs over Finite Fields
A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique prime factorization relative to the Cartesian product; but disconnected graphs are not uniquely prime factorable. This paper describes a system of modular arithmetic on graphs under which both connected and disconnected graphs have unique prime Cartesian factorizations.
متن کاملStrong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called Cartesian skeleton of the graphs under investigation. In this contribution, we show that every connected thin hypergraph H has a unique prime fact...
متن کاملThe factorization of the permanent of a matrix with minimal rank in prime characteristic
It is known that any square matrix A of size n over a field of prime characteristic p that has rank less than n/(p− 1) has a permanent that is zero. We give a new proof involving the invariant Xp. There are always matrices of any larger rank with non-zero permanents. It is shown that when the rank of A is exactly n/(p − 1), its permanent may be factorized into two functions involving Xp. Let n ...
متن کاملSparse and unique nonnegative matrix factorization through data preprocessing
Nonnegative matrix factorization (NMF) has become a very popular technique in machine learning because it automatically extracts meaningful features through a sparse and part-based representation. However, NMF has the drawback of being highly ill-posed, that is, there typically exist many different but equivalent factorizations. In this paper, we introduce a completely new way to obtaining more...
متن کاملHigher numerical ranges of matrix polynomials
Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae - General Algebra and Applications
سال: 2006
ISSN: 1509-9415,2084-0373
DOI: 10.7151/dmgaa.1103